Negotiation-based Routing
نویسنده
چکیده
Interdomain route selection is a complex process driven by constraints arising from topology, policy (e.g., commercial relationships), traffic engineering (e.g., load balancing), and performance. BGP was designed to find (a single) policy conformant route through the network for each source, destination pair. There are two fundamental problems with the route selection process of BGP. First, edge ISPs have too few options for selecting routes. Their choices are limited to the paths selected by their provider(s). As a result, there are many valid paths in the topology that cannot be used. Customers suffer when their providers select poor (from the customer’s perspective) routes, for instance, when the performance metrics for the provider and customer are different. This shortcoming is evident in trends such as increased multi-homing and the use of “intelligent routing” solutions such as those provided by RouteScience. The second problem, which is at the other extreme, is that the senders unilaterally select routes from those available to them. This ignores the traffic engineering needs of the destination and intermediate ISPs. We use the term traffic engineering to loosely refer to the process of controlling the paths through the network (driven by a high-level goal such as efficient use of the network). As a result of this route selection methodology, the destination ISP has no control over which of its upstreams gets used. Similarly, intermediate ISPs have no control over whether the upstream ISP would use the exported route, and if yes, for how much traffic. Over time hooks such as MEDs, communities, and extended communities have been added to the protocol to address this shortcoming. However, these hooks are both insufficient (e.g., ISPs have limited control over incoming paths) and have an unpredictable impact (e.g., MEDs can lead to persistent oscillations [4]). The solution to the first problem is to give more routing choices to the edge ISPs. The solution to the second problem is getting the intermediate and destinations ISPs involved in the route selection process such that the selected route suites all the ISPs. This route negotiation should be explicit and transparent, and its outcome predictable. Otherwise, the result may be a situation much like the current world in which ISPs try to manipulate the outcome to their benefit by trying to second-guess the actions of others. It is important to address both the problems together. Solving only the first exacerbates the second problem – it would be even harder for downstream ISPs to manage and provision their network, and may also have an impact on the overall stability of the Internet. Similarly, solving only the second exacerbates the first by further limiting the choices at the source ISP (downstream ISPs can reject certain routes).
منابع مشابه
Algorithm for Vehicle Routing Problem with Time Windows Based on Agent Negotiation
We suggest an efficient algorithm for the vehicle routing problem with time windows (VRPTW) based on agent negotiation. The algorithm is based on a set of generic negotiation methods and state-of-the-art insertion heuristics. Experimental results on well known Solomon’s and HombergerGehring benchmarks demonstrate that the algorithm outperforms previous agent based algorithms. The relevance of t...
متن کاملA Perspective Analysis of routing protocols in wireless sensor network
The Recent Advances in Wireless Sensor Networks which have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. It is necessary to identify the performance challenges of WSN and analyze their impact on the performance of routing protocols. It surveys recent routing protocols for sensor networks and presents a classification fo...
متن کاملInterdomain Routing with Negotiation
Current interdomain routing policies are largely based on information local to each ISP, in part due to competitive concerns and the lack of effective information sharing mechanisms. This can lead to routes that are sub-optimal and even to routes that oscillate. We explore a setting in which two neighboring ISPs negotiate to determine the path of the traffic they exchange. We first ask the basi...
متن کاملAn Agent-Based Approach for Flexible Routing in Dynamic Job Shop Scheduling
In an agent-based manufacturing system, a production schedule is developed through negotiation between system agents. With the Contract-net protocol that has been employed as an agent-based negotiation mechanism for many years, cooperation arises in the relationship between resource and job agents as they work to create these schedules. However, the interactions among the resource agents themse...
متن کاملA Bandwidth-Broker Based Inter-domain SLA Negotiation
This work presents an Inter-Domain Bandwidth Broker (BB) based Service Level Agreements (SLAs) Negotiation Model for Differentiated Services (DiffServ) networks. A BB in each DiffServ domain handles SLAs on behalf of its domain by communicating with its neighboring peers. The proposed model uses a destination-based SLAs aggregation to increase signaling and state scalability, and it uses a BB-b...
متن کاملAn Heterarchical Multi-agent System for the Integration of Process Planning and Scheduling Using Operation-based Time-extended Negotiation Protocols
It is proposed in this paper the on-line adaptation of process plan with alternatives, through the application of an operation-based time-extended negotiation protocol for decision-making about real-time routing of job orders of parts composed of machining operations in a job-shop environment. The protocol is modified from the contract net protocol to cater for the multiple tasks and many-to-ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003